A maximum principle for graphs

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stochastic Incompleteness for Graphs and Weak Omori-yau Maximum Principle

We prove an analogue of the weak Omori-Yau maximum principle and Khas’minskii’s criterion for graphs in the general setting of Keller and Lenz. Our approach naturally gives the stability of stochastic incompleteness under certain surgeries of graphs. It allows to develop a unified approach to all known criteria of stochastic completeness/incompleteness, as well as to obtain new criteria.

متن کامل

A Maximum Principle for Combinatorial Yamabe Flow

In his proof of Andreev’s theorem, Thurston in [1] introduced a conformal geometric structure on two dimensional simplicial complexes which is an analogue of a Riemannian metric. He then used a version of curvature to prove the existence of circle-packings (see also Marden-Rodin [2] for more exposition). Techniques very similar to elliptic partial differential equation techniques were used by Y...

متن کامل

A Maximum Principle for Beltrami Color Flow

We study, in this work, the maximum principle for the Beltrami color flow and the stability of the flow’s numerical approximation by finite difference schemes. We discuss, in the continuous case, the theoretical properties of this system and prove the maximum principle in the strong and the weak formulations. In the discrete case, all the second order explicit schemes, that are currently used, ...

متن کامل

Gradient Maximum Principle for Minima

We state a maximum principle for the gradient of the minima of integral functionals I (u)G Ω [ f (∇u)Cg(u)] dx, on ūCW 1,1 0 (Ω ), just assuming that I is strictly convex. We do not require that f, g be smooth, nor that they satisfy growth conditions. As an application, we prove a Lipschitz regularity result for constrained minima.

متن کامل

The Pontryagin Maximum Principle

Theorem (PontryaginMaximum Principle). Suppose a final time T and controlstate pair (û, x̂) on [τ, T ] give the minimum in the problem above; assume that û is piecewise continuous. Then there exist a vector of Lagrange multipliers (λ0, λ) ∈ R × R with λ0 ≥ 0 and a piecewise smooth function p: [τ, T ] → R n such that the function ĥ(t) def =H(t, x̂(t), p(t), û(t)) is piecewise smooth, and one has ̇̂ ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory

سال: 1967

ISSN: 0021-9800

DOI: 10.1016/s0021-9800(67)80013-9